Hardness-Aware Restart Policies
نویسندگان
چکیده
Recent work has demonstrated that it is possible to boost the efficiency of combinatorial search procedures via the use of principled restart policies. We present a coupling of machine learning and dynamic programming that extends prior efforts by endowing restart policies with knowledge of the hardness of the specific instance being solved. This ability allows a restart policy to take into consideration an updated probability distribution over hardness as a previously unseen instance is being solved. We discuss the methods, highlighting their importance for real-world applications of combinatorial search. Finally, we present the empirical results.
منابع مشابه
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
In this paper, we present a new class of restart policies, called width-based policies, for modern clause-learning SAT solvers. The new policies encourage the solvers to find refutation proofs with small widths by determining restarting points based on the sizes of conflict clauses learned rather than the number of conflicts experienced by the solvers. We show that width-based restart policies ...
متن کاملRestart Policies with Dependence among Runs: A Dynamic Programming Approach
The time required for a backtracking search procedure to solve a problem can be reduced by employing randomized restart procedures. To date, researchers designing restart policies have relied on the simplifying assumption that runs are probabilistically independent from one another. We relax the assumption of independence among runs and address the challenge of identifying an optimal restart po...
متن کاملThe Effect of Restarts on the Efficiency of Clause Learning
Given the common use of restarts in today’s clause learning SAT solvers, the task of choosing a good restart policy appears to have attracted remarkably little interest. Many solvers, for example, restart once every k conflicts with such a diverse choice of k as to give the impression that one policy may be just as good as another. On the other hand, results have been reported on the use of dif...
متن کاملIterative restart technique for solving timetabling problems
Restart techniques for randomizing complete search algorithms were proposed recently by Gomes et al., for solving hard combinatorial problems. A new iterative algorithm that uses restart techniques is proposed, and its behavior analyzed on random timetabling problems. Employee timetabling problems (ETPs) can naturally represented by constraints networks for real world instances which are large ...
متن کاملPlayback Restart in Interactive Streaming Video Applications
Low latency is crucial in networked multimedia applications such as on-demand streaming audio and video. In this paper, we consider the problem of restarting or resuming playback following an interactive operation such as fast forward, rewind, or indexed jump in stored on-demand video. We present two approaches to restart playback after an interactive operation, and develop algorithms to comput...
متن کامل